Constructive and Clustering Methods to Solve Capacitated Vehicle Routing Problem
نویسندگان
چکیده
منابع مشابه
Constructive and Clustering Methods to Solve Capacitated Vehicle Routing Problem
Vehicle Routing Problem (VRP) is a real life constraint satisfaction problem to find minimal travel distances of vehicles to serve customers. Capacitated VRP (CVRP) is the simplest form of VRP considering vehicle capacity constraint. Constructive and clustering are the two popular approaches to solve CVRP. A constructive approach creates routes and attempts to minimize the cost at the same time...
متن کاملUsing Greedy Clustering Method to Solve Capacitated Location-Routing Problem with Fuzzy Demands
Using Greedy Clustering Method to Solve Capacitated Location-Routing Problem with Fuzzy Demands Abstract In this paper, the capacitated location routing problem with fuzzy demands (CLRP_FD) is considered. In CLRP_FD, facility location problem (FLP) and vehicle routing problem (VRP) are observed simultaneously. Indeed the vehicles and the depots have a predefined capacity to serve the customerst...
متن کاملFuzzy Clustering for Initialization of Simulated Annealing Algorithm to Solve a Capacitated Vehicle Routing Problem
Vehicle Routing Problem (VRP) has been an interesting research area since its introduction. There are various types of VRP models and different solution techniques proposed for this problem. This paper uses several clustering algorithms in initialization of Simulated Annealing to solve VRP. The main contribution of this research is to assess the effect of using some clustering methods in buildi...
متن کاملHeuristic Methods for Capacitated Vehicle Routing Problem
The Capacitated Vehicle Routing Problem (CVRP) is a well known problem in the optimization literature. In this paper, we consider that there is a single depot (or distribution centre) that caters to the customer demands at a set of sales points (or demand centers) using vehicles with known limited capacities. The demand at each of these demand centers is assumed to be constant and known. Due to...
متن کاملusing greedy clustering method to solve capacitated location-routing problem with fuzzy demands
using greedy clustering method to solve capacitated location-routing problem with fuzzy demands abstract in this paper, the capacitated location routing problem with fuzzy demands (clrp_fd) is considered. in clrp_fd, facility location problem (flp) and vehicle routing problem (vrp) are observed simultaneously. indeed the vehicles and the depots have a predefined capacity to serve the customerst...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Oriental journal of computer science and technology
سال: 2017
ISSN: 0974-6471,2320-8481
DOI: 10.13005/ojcst/10.03.02